Computational complexity theory

Results: 2049



#Item
11Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald  Roger Wattenhofer

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:25
12TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

Add to Reading List

Source URL: www.ads.tuwien.ac.at

Language: English - Date: 2015-02-11 08:09:39
13Curriculum Vitae: Alexis C. Kaporis  Contact information Address :  Phone:

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

Add to Reading List

Source URL: students.ceid.upatras.gr

Language: English - Date: 2006-02-09 03:56:19
14Thursday 31 March  EvoCOP 1 - Real World Applications, 11:30-13:10 Chaired by Francisco Chicano Particle Swarm Optimization for Multi-Objective Web Service Location Allocation,

Thursday 31 March EvoCOP 1 - Real World Applications, 11:30-13:10 Chaired by Francisco Chicano Particle Swarm Optimization for Multi-Objective Web Service Location Allocation,

Add to Reading List

Source URL: www.evostar.org

Language: English - Date: 2016-03-15 10:32:14
15Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:52
16arXiv:1505.04514v1 [cs.DC] 18 MayA Local Broadcast Layer for the SINR Network Model Magn´ us M. Halld´orsson∗

arXiv:1505.04514v1 [cs.DC] 18 MayA Local Broadcast Layer for the SINR Network Model Magn´ us M. Halld´orsson∗

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2015-05-18 20:53:11
17Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is

Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is

Add to Reading List

Source URL: www.cse.iitk.ac.in

Language: English - Date: 2016-07-30 09:35:21
18Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:44
19Security Watch  Rebecca T. Mercuri Superscaled Security Exponential increases in computational speed, memory capacity, and

Security Watch Rebecca T. Mercuri Superscaled Security Exponential increases in computational speed, memory capacity, and

Add to Reading List

Source URL: www.notablesoftware.com

Language: English - Date: 2007-02-28 17:32:49
20LNCSEfficient Dynamic Aggregation

LNCSEfficient Dynamic Aggregation

Add to Reading List

Source URL: webee.technion.ac.il

Language: English - Date: 2007-05-14 09:17:03